Efficient triangulation of simple polygons
نویسندگان
چکیده
منابع مشابه
Fast Triangulation of Simple Polygons
We present a new algorithm for triangulating simple polygons that has four advantages over previous solutions [GJPT, Ch]. a) It is faster: Whilst previous solutions worked in time O(nlogn), the new algorithm only needs time O(n+rlogr) where r is the number of concave angles of the polygon. b) It works for a larger class of inputs: Whilst previous solutions worked for simple polygons, the new al...
متن کاملLinear Time Triangulation of Simple Polygons
From the early days of computational geometry, practitioners have looked for faster ways to triangulate a simple polygon. Several near-linear time algorithms have been devised and implemented. However, the true linear time algorithms of Chazelle and Amato et al. are considered impractical for actual use despite their faster asymptotic running time. In this paper, I examine the latter of these i...
متن کاملAn Overview of Triangulation Algorithms for Simple Polygons
Decomposing simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. Different techniques for triangulating simple polygon were designed. The first part of the paper is an overview of triangulation algorithms based on diagonal inserting. In the second part we present algorit...
متن کاملFast Triangulation of the Plane with Respect to Simple Polygons
Let P~,..., Pk be pairwise non-intersecting simple polygons with a total of n vertices and s start vertices. A start vertex, in general, is a vertex both of which neighbors have larger x coordinate. We present an algorithm for triangulating P~,..., Pk in time O(n + s log s). s may be viewed as a measure of non-convexity. In particular, s is always bounded by the number of concave angles + 1, an...
متن کاملA Contribution to Triangulation Algorithms for Simple Polygons
Decomposing simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. The known algorithms for polygon triangulation can be classified into three groups: algorithms based on diagonal inserting, algorithms based on Delaunay triangulation, and the algorithms using Steiner point...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Visual Computer
سال: 1991
ISSN: 0178-2789,1432-8726
DOI: 10.1007/bf01905693